منابع مشابه
Nikolai Kliuev-prophet of Loss
The life, work, and reception of Nikolai Kliuev (1884-1937) provide striking illustrations of the intense preoccupation in Russian culture with the association between poetry and prophecy, between poet and prophet. Kliuev's work abounds in prophetic statements of many kinds, while he frequently and selfconsciously positioned himself as a "prophet" and explicitly identified his work as "propheti...
متن کاملWhose Kliuev, Who is Kliuev? Polemics of Identity and Poetry
The poet Nikolai Kliuev (1884–1937) has fascinated and provoked to polemics successive generations of Russian readers, attracting to this day treatments that range from the hagiographical to the denunciatory. In his own lifetime he elicited strikingly diverse reactions from those who came into contact with him or who read him. In many cases, those reactions, both hostile and favourable, sprang ...
متن کاملIn Memory of Nikolai Pavlovich Korneichuk
Nikolai Pavlovich Korneichuk passed away on July 22, 2003. He was recognized worldwide as a leading expert on exact solutions of extremal problems in Approximation Theory as well as a founder of a powerful research school. N.P. Korneichuk was born on January 22, 1920 in the village of Bobrik, in Gomel region of Belarus. His parents were peasants. In 1938, N.P. Korneichuk completed studies in th...
متن کاملPolymatroid Prophet Inequalities
Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence at once. The goal of both is to decide on fractions of each number they want to keep so as to maximize the weighted fractional sum of the numbers chosen. The classic result of Krengel and Sucheston (1977-78) asserts th...
متن کاملCombinatorial Prophet Inequalities
We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an O(1)-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an O(log n log r)-competitive algorithm (where r is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Slavic and East European Journal
سال: 2005
ISSN: 0037-6752
DOI: 10.2307/20058347